Rainbow matchings and Hamilton cycles in random graphs

نویسندگان

Deepak Bal

Alan M. Frieze

چکیده

Let HPn,m,k be drawn uniformly from all m-edge, k-uniform, k-partite hypergraphs where each part of the partition is a disjoint copy of [n]. We let HP (κ) n,m,k be an edge colored version, where we color each edge randomly from one of κ colors. We show that if κ = n and m = Kn log n where K is sufficiently large then w.h.p. there is a rainbow colored perfect matching. I.e. a perfect matching in which every edge has a different color. We also show that if n is even and m = Kn log n where K is sufficiently large then w.h.p. there is a rainbow colored Hamilton cycle in G (n) n,m. Here G (n) n,m denotes a random edge coloring of Gn,m with n colors. When n is odd, our proof requires m = ω(n log n) for there to be a rainbow Hamilton cycle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs

Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set of pairs of matchings must each produce Hamilton cycles (with suitable restrictions on the presc...

متن کامل

On matchings and Hamilton cycles in random graphs

متن کامل

A ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS SVANTE JANSON

A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.

متن کامل